Recurrence and Transience for Long-Range Reversible Random Walks on a Random Point Process

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On recurrence and transience of self-interacting random walks

Let μ1, . . . , μk be d-dimensional probability measures in R with mean 0. At each time we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience of such processes and also construct examples of recurrent processes of this type. In particular, in dimension 3 we give the complete picture: every walk generated by...

متن کامل

Recurrence and transience of multitype branching random walks

We study a discrete time Markov process with particles being able to perform discrete time random walks and create new particles, known as branching random walk (BRW). We suppose that there are particles of di erent types, and the transition probabilities, as well as o spring distribution, depend on the type and the position of the particle. Criteria of (strong) recurrence and transience are pr...

متن کامل

Random walks with long-range self-repulsion on proper time

We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent ν are obtained. They are in good agreement with Monte Carlo simulations in two dimensions. A numerical study of the scaling functions and of the efficiency of the algorithm is also presented.

متن کامل

Long-Range Navigation on Complex Networks using Lévy Random Walks

We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long...

متن کامل

2 9 Ja n 20 04 DEGREES OF TRANSIENCE AND RECURRENCE AND HIERARCHICAL RANDOM WALKS

The notion of degree and related notions concerning recurrence and transience for a class of Lévy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2009

ISSN: 1083-6489

DOI: 10.1214/ejp.v14-721